在多机构系统（例如多机构无人驾驶汽车和多机构自动驾驶水下车辆）中，羊群控制是一个重大问题，可增强代理的合作和安全性。与传统方法相反，多机构增强学习（MARL）更灵活地解决了羊群控制的问题。但是，基于MARL的方法遭受了样本效率低下的影响，因为它们需要从代理与环境之间的相互作用中收集大量的经验。我们提出了一种新颖的方法，该方法对MARL（PWD-MARL）的示范进行了预处理，该方法可以利用以传统方法预处理剂来利用非专家示范。在预审进过程中，代理人同时通过MARL和行为克隆从示范中学习政策，并阻止过度拟合示范。通过对非专家示范进行预处理，PWD-MARL在温暖的开始中提高了在线MAL的样品效率。实验表明，即使发生不良或很少的示威，PWD-MARL在羊群控制问题中提高了样本效率和政策性能。

羊群控制是一个具有挑战性的问题，在维持羊群的同时，需要达到目标位置，并避免了环境中特工之间的障碍和碰撞碰撞。多代理增强学习在羊群控制中取得了有希望的表现。但是，基于传统强化学习的方法需要代理与环境之间的相互作用。本文提出了一项次优政策帮助多代理增强学习算法（SPA-MARL），以提高样本效率。 Spa-Marl直接利用可以通过非学习方法手动设计或解决的先前政策来帮助代理人学习，在这种情况下，该策略的表现可以是最佳的。 SPA-MARL认识到次优政策与本身之间的性能差异，然后模仿次优政策，如果次优政策更好。我们利用Spa-Marl解决羊群控制问题。基于人造潜在领域的传统控制方法用于生成次优政策。实验表明，水疗中心可以加快训练过程，并优于MARL基线和所使用的次优政策。

根据数据得出的模型的顺序/维度通常受观测值的数量或受监视系统（传感节点）的上下文的限制。对于结构系统（例如，民用或机械结构）尤其如此，这通常是高维本质上的。在物理知识的机器学习范围内，本文提出了一个框架（称为神经模态odes），以将基于物理学的建模与深度学习（尤其是神经通用差分方程 - 神经odes）整合在一起，以建模受监视和高的动态。 - 维工程系统。在这种启动探索中，我们将自己限制在线性或轻度非线性系统中。我们提出了一种结构，该体系结构将变异自动编码器的动态版本与物理信息的神经odes（Pi-神经odes）融合在一起。作为自动编码器的一部分，编码器从观测数据的前几个项目到潜在变量的初始值学习了抽象映射，从而驱动通过物理知识的神经odes学习嵌入式动力学，并施加\ textit {模态模型}该潜在空间的结构。所提出的模型的解码器采用了从应用于基于物理学模型的线性化部分的本征分析中得出的本征模：一种隐含携带自由度（DOFS）之间的空间关系的过程。该框架在数值示例中得到了验证，以及一个缩放的电缆固定桥的实验数据集，在该数据集中，学到的混合模型被证明胜过纯粹基于物理的建模方法。我们进一步显示了在虚拟传感的上下文中，即从空间稀疏数据中恢复了未衡量的DOF中的广义响应量。

本地化和导航是基本的机器人任务，需要准确，最新的地图才能完成这些任务，众包数据可检测地图更改，提出了吸引人的解决方案。收集和处理众包数据需要低成本的传感器和算法，但是现有的方法依赖于昂贵的传感器或计算昂贵的算法。此外，没有现有数据集来评估点云更改检测。因此，本文提出了一个使用低成本传感器（如立体声摄像机和IMU）来检测点云图中的变化的新型框架。此外，我们创建了一个数据集和相应的指标，借助高保真模拟器虚幻引擎4.实验表明，我们的视觉框架可以有效地检测数据集中的变化。

非政策评估（OPE）是用其他策略生成的数据评估目标策略。大多数以前的OPE方法都侧重于精确估计策略的真实绩效。我们观察到，在许多应用程序中，（1）OPE的最终目标是比较两个或多个候选策略并选择一个好的策略，这比精确评估其真实绩效要简单得多； （2）通常已经部署了多种政策来为现实世界中的用户提供服务，因此可以知道这些策略的真实绩效。受到这两个观察结果的启发，在这项工作中，我们研究了一个新问题，监督了政体排名（SOPR），该排名旨在通过利用现有绩效的非政策数据和策略来对基于监督学习的一组目标策略进行排名。我们提出了一种解决SOPR的方法，该方法通过最大程度地减少培训政策的排名损失而不是估算精确的政策绩效来学习政策评分模型。我们方法中的评分模型是一个基于层次变压器的模型，将一组状态行动对映射到一个分数，其中每对的状态来自非政策数据，而目标策略是在状态上采取的。以离线方式。公共数据集的广泛实验表明，我们的方法在等级相关性，遗憾价值和稳定性方面优于基线方法。我们的代码在GitHub公开获得。

This paper focuses on designing efficient models with low parameters and FLOPs for dense predictions. Even though CNN-based lightweight methods have achieved stunning results after years of research, trading-off model accuracy and constrained resources still need further improvements. This work rethinks the essential unity of efficient Inverted Residual Block in MobileNetv2 and effective Transformer in ViT, inductively abstracting a general concept of Meta-Mobile Block, and we argue that the specific instantiation is very important to model performance though sharing the same framework. Motivated by this phenomenon, we deduce a simple yet efficient modern \textbf{I}nverted \textbf{R}esidual \textbf{M}obile \textbf{B}lock (iRMB) for mobile applications, which absorbs CNN-like efficiency to model short-distance dependency and Transformer-like dynamic modeling capability to learn long-distance interactions. Furthermore, we design a ResNet-like 4-phase \textbf{E}fficient \textbf{MO}del (EMO) based only on a series of iRMBs for dense applications. Massive experiments on ImageNet-1K, COCO2017, and ADE20K benchmarks demonstrate the superiority of our EMO over state-of-the-art methods, \eg, our EMO-1M/2M/5M achieve 71.5, 75.1, and 78.4 Top-1 that surpass \textbf{SoTA} CNN-/Transformer-based models, while trading-off the model accuracy and efficiency well.

The development of social media user stance detection and bot detection methods rely heavily on large-scale and high-quality benchmarks. However, in addition to low annotation quality, existing benchmarks generally have incomplete user relationships, suppressing graph-based account detection research. To address these issues, we propose a Multi-Relational Graph-Based Twitter Account Detection Benchmark (MGTAB), the first standardized graph-based benchmark for account detection. To our knowledge, MGTAB was built based on the largest original data in the field, with over 1.55 million users and 130 million tweets. MGTAB contains 10,199 expert-annotated users and 7 types of relationships, ensuring high-quality annotation and diversified relations. In MGTAB, we extracted the 20 user property features with the greatest information gain and user tweet features as the user features. In addition, we performed a thorough evaluation of MGTAB and other public datasets. Our experiments found that graph-based approaches are generally more effective than feature-based approaches and perform better when introducing multiple relations. By analyzing experiment results, we identify effective approaches for account detection and provide potential future research directions in this field. Our benchmark and standardized evaluation procedures are freely available at: https://github.com/GraphDetec/MGTAB.

Recently, great progress has been made in single-image super-resolution (SISR) based on deep learning technology. However, the existing methods usually require a large computational cost. Meanwhile, the activation function will cause some features of the intermediate layer to be lost. Therefore, it is a challenge to make the model lightweight while reducing the impact of intermediate feature loss on the reconstruction quality. In this paper, we propose a Feature Interaction Weighted Hybrid Network (FIWHN) to alleviate the above problem. Specifically, FIWHN consists of a series of novel Wide-residual Distillation Interaction Blocks (WDIB) as the backbone, where every third WDIBs form a Feature shuffle Weighted Group (FSWG) by mutual information mixing and fusion. In addition, to mitigate the adverse effects of intermediate feature loss on the reconstruction results, we introduced a well-designed Wide Convolutional Residual Weighting (WCRW) and Wide Identical Residual Weighting (WIRW) units in WDIB, and effectively cross-fused features of different finenesses through a Wide-residual Distillation Connection (WRDC) framework and a Self-Calibrating Fusion (SCF) unit. Finally, to complement the global features lacking in the CNN model, we introduced the Transformer into our model and explored a new way of combining the CNN and Transformer. Extensive quantitative and qualitative experiments on low-level and high-level tasks show that our proposed FIWHN can achieve a good balance between performance and efficiency, and is more conducive to downstream tasks to solve problems in low-pixel scenarios.

Implicit regularization is an important way to interpret neural networks. Recent theory starts to explain implicit regularization with the model of deep matrix factorization (DMF) and analyze the trajectory of discrete gradient dynamics in the optimization process. These discrete gradient dynamics are relatively small but not infinitesimal, thus fitting well with the practical implementation of neural networks. Currently, discrete gradient dynamics analysis has been successfully applied to shallow networks but encounters the difficulty of complex computation for deep networks. In this work, we introduce another discrete gradient dynamics approach to explain implicit regularization, i.e. landscape analysis. It mainly focuses on gradient regions, such as saddle points and local minima. We theoretically establish the connection between saddle point escaping (SPE) stages and the matrix rank in DMF. We prove that, for a rank-R matrix reconstruction, DMF will converge to a second-order critical point after R stages of SPE. This conclusion is further experimentally verified on a low-rank matrix reconstruction problem. This work provides a new theory to analyze implicit regularization in deep learning.

Video representation learning has been successful in video-text pre-training for zero-shot transfer, where each sentence is trained to be close to the paired video clips in a common feature space. For long videos, given a paragraph of description where the sentences describe different segments of the video, by matching all sentence-clip pairs, the paragraph and the full video are aligned implicitly. However, such unit-level similarity measure may ignore the global temporal context over a long time span, which inevitably limits the generalization ability. In this paper, we propose a contrastive learning framework TempCLR to compare the full video and the paragraph explicitly. As the video/paragraph is formulated as a sequence of clips/sentences, under the constraint of their temporal order, we use dynamic time warping to compute the minimum cumulative cost over sentence-clip pairs as the sequence-level distance. To explore the temporal dynamics, we break the consistency of temporal order by shuffling the video clips or sentences according to the temporal granularity. In this way, we obtain the representations for clips/sentences, which perceive the temporal information and thus facilitate the sequence alignment. In addition to pre-training on the video and paragraph, our approach can also generalize on the matching between different video instances. We evaluate our approach on video retrieval, action step localization, and few-shot action recognition, and achieve consistent performance gain over all three tasks. Detailed ablation studies are provided to justify the approach design.